Pareto- Front Generation by Classical and Meta-heuristic Methods in Flexible Job Shop Scheduling with Multiple Objectives
نویسندگان
چکیده
منابع مشابه
Pareto- Front Generation by Classical and Meta-heuristic Methods in Flexible Job Shop Scheduling with Multiple ObjectivesPareto- Front Generation by Classical and Meta-heuristic Methods in Flexible Job Shop Scheduling with Multiple Objectives
Planning and scheduling are as decision making processes which they have important roles in production systems and industries. According that, job shop scheduling is one of NPhard problems to solve multi-objective decision making approaches. So, the problem is known as uncertain with many variables in optimal solution view. Finding optimal solutions are essential task in scheduling of jobs betw...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملModeling and Meta-heuristic Solution for Flexible Shop Scheduling
In this paper, an extended class of flexible shop scheduling problems is considered. First, the problem is translated into a mathematical programming formula, i.e., a mixed-integer programming problem. This makes it possible to apply standard packages of mixed integer programming solvers and, while lots of computational time is required in general, to obtain the optimal schedule. Then, in order...
متن کاملA column generation heuristic for complex job shop multiple orders per job scheduling
Scheduling in semiconductor manufacturing is a challenging task due to inherent complexities like assignment of multiple customer orders to front opening unified pods (FOUPs), batch processing in multiple toolgroups with parallel machines, and re-entrant flow. A disjunctive–network-flow mixed integer program (DNF) and a column generation heuristic are presented to minimize the sum of weighted c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017913476